منابع مشابه
Semi-algebraic neighborhoods of closed semi-algebraic sets
— Given a closed (not necessarly compact) semi-algebraic set X in Rn, we construct a non-negative semi-algebraic C2 function f such that X=f−1(0) and such that for δ > 0 sufficiently small, the inclusion of X in f−1([0, δ]) is a retraction. As a corollary, we obtain several formulas for the Euler characteristic of X. Résumé. — Étant donné un ensemble semi-algébrique fermé (non nécessairement co...
متن کاملAlgebraic boundaries of convex semi-algebraic sets
We study the algebraic boundary of a convex semi-algebraic set via duality in convex and algebraic geometry. We generalise the correspondence of facets of a polytope with the vertices of the dual polytope to general semi-algebraic convex sets. In this case, exceptional families of extreme points might exist and we characterise them semi-algebraically. We also give a strategy for computing a com...
متن کاملOn the Volume of Tubular Neighborhoods of Real Algebraic Varieties
The problem of determining the volume of a tubular neighborhood has a long and rich history. Bounds on the volume of neighborhoods of algebraic sets have turned out to play an important role in the probabilistic analysis of condition numbers in numerical analysis. We present a self-contained derivation of bounds on the probability that a random point, chosen uniformly from a ball, lies within a...
متن کاملAlgebraic characteristic sets of matroids
For a matroid M, define the algebraic characteristic set x4(M) to be the set of field characteristics over which M can be algebraically represented. We construct many examples of rank three matroids with finite, non-singleton algebraic characteristic sets. We also determine x,,(PG(Z, p)) and xa(AG(2, p)). An infinite family of rank three matroids with empty algebraic characteristic set is const...
متن کاملCovering rough sets based on neighborhoods: An approach without using neighborhoods
Rough set theory, a mathematical tool to deal with inexact or uncertain knowledge in information systems, has originally described the indiscernibility of elements by equivalence relations. Covering rough sets are a natural extension of classical rough sets by relaxing the partitions arising from equivalence relations to coverings. Recently, some topological concepts such as neighborhood have b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1983
ISSN: 0002-9947
DOI: 10.2307/1999065